Fuzzy multiset finite automata with output

نویسندگان

چکیده

Abstract Fuzzy multiset finite automata with output represent fuzzy version of (with output) working over multisets. This paper introduces Mealy-like, Moore-like, and compact automata. Their mutual transformations are described to prove their equivalent behaviours. Furthermore, various variants reduced studied where the reductions directed decrease number components (like initial distribution, transition relation, or relation) The research confirmed that all can be without change

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted finite automata with output

In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.

متن کامل

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

متن کامل

Multiset Storage Automata

Two kinds of multiset automata with a storage attached, varying only in their ability of testing the storage for emptiness, are introduced, as well as normal forms. Their accepting power and relation to other multiset languages classes is investigated.

متن کامل

Pushdown automata, multiset automata, and Petri nets

In this paper, we consider various classes of (in)nite-state) automata generated by simple rewrite transition systems. These classes are de)ned by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way, we provide natural definitions for commutat...

متن کامل

State Complexity of Reversals of Deterministic Finite Automata with Output

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2022

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-022-07274-7